The Semiring Variety Generated by Any Finite Number of Finite Fields and Distributive Lattices
نویسندگان
چکیده
We study the semiring variety V generated by any finite number of finite fields F1, . . . , Fk and two-element distributive lattice B2, i.e., V = HSP{B2, F1, . . . , Fk}. It is proved that V is hereditarily finitely based, and that, up to isomorphism, B2 and all subfields of F1, . . . , Fk are the only subdirectly irreducible semirings in V.
منابع مشابه
The Variety of Semirings Generated by Distributive Lattices and Finite Fields
A semiring variety is d-semisimple if it is generated by the distributive lattice of order two and a finite number of finite fields. A d-semisimple variety V = HSP{B2, F1, . . . , Fk} plays the main role in this paper. It will be proved that it is finitely based, and that, up to isomorphism, the two-element distributive lattice B2 and all subfields of F1, . . . , Fk are the only subdirectly irr...
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملSplittings in the variety of residuated lattices
The operation ‘·’, often called fusion is distributive over join. In finite residuated lattices, fusion and join determine residuation uniquely, although residuation cannot be defined equationally from other operations. The class R of residuated lattices is a variety. It is arithmetical, has CEP, and is generated by its finite members (cf. [7]). It is also congruence 1-regular, i.e., for any co...
متن کاملPAWS: A Tool for the Analysis of Weighted Systems
PAWS is a tool to analyse the behaviour of weighted automata and conditional transition systems. At its core PAWS is based on a generic implementation of algorithms for checking language equivalence in weighted automata and bisimulation in conditional transition systems. This architecture allows for the use of arbitrary user-defined semirings. New semirings can be generated during run-time and ...
متن کاملVarieties of Lattices with Geometric Descriptions
A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved. Herrmann, Pickering, and Roddy proved in 1994 that every modular lattice can be embedded, within its variety, into an algebraic and spatial lattice. We extend this r...
متن کامل